Belief, Provability, and Logic Programs
نویسندگان
چکیده
The main goal of this paper is to establish a nonmonotonic epistemic logic EB with two modalities – provability and belief – capable of expressing and comparing a variety of known semantics for extended logic programs, and clarify their meaning. In particular we present here, for the first time, embeddings into epistemic logic of logic programs extended with a second kind of negation under the well– founded semantics, and contrast them to the recent embeddings into autoepistemic logics of such programs under stable models based semantics. Because of the newly established relationship between our epistemic logic EB and extended program semantics, the former benefits from the procedures and implementations of the latter, and can be applied to at least the same class of AI problems that the latter can. Moreover, one issue of epistemic logic introduced here, belief revision, can profit from adapting techniques employed by the latter for contradiction removal. Furthermore, the language of the epistemic logic presented here being more general than that of extended programs, it offers a basic tool for further generalizations of the latter, for instance regarding disjunction and modal operators.
منابع مشابه
On Normal Forms and Equivalence for Logic Programs
It is known that larger classes of formulae than Horn clauses may be used as logic programming languages. One such class of formulae is hereditary Harrop formulae, for which an operational notion of provability has been studied, and it is known that operational provability corresponds to prov-ability in intuitionistic logic. In this paper we discuss the notion of a normal form for this class of...
متن کاملOn Goal-Directed Provability in Classical Logic
One of the key features of logic programming is the notion of goal-directed prov-ability. In intuitionistic logic, the notion of uniform proof has been used as a proof-theoretic characterization of this property. Whilst the connections between intuition-istic logic and computation are well known, there is no reason per se why a similar notion cannot be given in classical logic. In this paper we...
متن کاملSemantics of disjunctive programs with monotone aggregates - an operator-based approach
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can be derived from it. No such systematic operator-based approach to semantics of disjunctive logic programs has been developed so far. This paper is the first step in this direction. We formalize the concept of one-step-...
متن کاملProject Report Logic Programming in Constructive Provability Logic 15-816 Modal Logic
We present a novel formulation of CPL, a constructive logic of provability that is closely connected to the Gödel-Löb logic of provability. Our logical formulation allows modal operators to talk about both provability and non-provability of propositions at reachable worlds. We use this logic as a basis for a discussion of negation in logic programming.
متن کاملHierarchical Meta-Logics for Belief and Provability: How We Can Do Without Modal Logics
14 Vladimir Lifschitz have provided useful feedback. Alex Simpson has proof checked some versions of this paper and corrected some of the mistakes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994